A Three-Layered Multifactorial Evolutionary Algorithm with Parallelization for Large-Scale Engraving Path Planning

نویسندگان

چکیده

Today, although laser engraving technology is widely used in 2D image engraving, when the larger and more complicated, most existing algorithms for path planning have a huge computational burden reduced efficiency. Accordingly, this article addresses trajectory optimization problem large-scale engraving. First, we formulate as an improved model based on traveling salesman (TSP). Then, propose three-layered algorithm called 3L-MFEA-MP, structured follows: upper layer, genetic (GA); middle GA; bottom parallel multifactorial evolutionary algorithm. Experiments four classic TSP datasets show that our exhibits superior performance terms of length time compared with other algorithms. In particular, single-thread algorithm, proposed by 80%. Moreover, machine experiment demonstrated mona-lisa 100K, vangogh 120K, venus 140K was approximately one tenth traditional dot method. The results indicate can reduce improve efficiency planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations

Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...

متن کامل

Evolutionary Path Planning Algorithm for Industrial Robots

This paper proposed a new methodology to solve collision free path planning problem for industrial robot using genetic algorithms. The method poses an optimization problem that aims to minimize the significant points traveling distance of the robot. The behaviour of more two operational parameters – the end effector traveling distance and computational time – is analysed. This algorithm is able...

متن کامل

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

A Three dimensional Path Planning algorithm

Motion planning is one of the important tasks in intelligent control of an autonomous mobile robot. Path planning is to generate a collision free path in an environment with obstacles with respect to some criterion. Trajectory planning is to schedule the movement of a mobile robot along the planned path. Several approaches have been proposed to address the problem of motion planning of a mobile...

متن کامل

A Path-Generation Matheuristic for Large Scale Evacuation Planning

In this study we present a general matheuristic that decomposes the problem being solved in a master and a subproblem. In contrast with the column generation technique, the proposed approach does not rely on the explicit pricing of new columns but instead exploits features of the incumbent solution to generate one or more columns in the master problem. We apply this approach to large scale evac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11111712